A study on “free-riding” traffic problem in routing overlay networks

نویسندگان

  • Go HASEGAWA
  • Masayoshi KOBAYASHI
  • Masayuki MURATA
  • Tutomu MURASE
چکیده

In this paper, we discuss the “free-riding”traffic problem in routing overlay networks, which is mainly caused by policy mis-match between the overlay routing and the underlay IP routing. We first define the free-riding problem in routing overlay network, and construct mathematical models for the amount of the free-riding traffic. We next present the numerical examples on the effectiveness of the overlay routing and the amount of free-riding traffic, and point out that we expect significant amount of free-riding traffic in the actual Internet environment.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Enhanced Search Technique for Managing Partial Coverage and Free Riding in P2P Networks

This paper presents a Q-learning based scheme for managing the partial coverage problem and the ill effects of free riding in unstructured P2P networks. Based on various parameter values collected during query routing, reward for the actions are computed and these rewards are used for updating the corresponding Q-values of peers. Thus, the routing is done through only nodes, which have shown hi...

متن کامل

Dynamic overlay routing based on available bandwidth estimation: A simulation study

Dynamic overlay routing has been proposed as a way to enhance the reliability and performance of IP networks. The major premise is that overlay routing can bypass congestion, transient outages, or suboptimal paths, by forwarding traffic through one or more intermediate overlay nodes. In this paper, we perform an extensive simulation study to investigate the performance of dynamic overlay routin...

متن کامل

Inter-domain policy violations in multi-hop overlay routes: Analysis and mitigation

The Internet is a complex structure arising from the interconnection of numerous autonomous systems (AS), each exercising its own administrative policies to reflect the commercial agreements behind the interconnection. However, routing in service overlay networks is quite capable of violating these policies to its advantage. To prevent these violations, we see an impending drive in the current ...

متن کامل

A game-theoretic analysis of the implications of overlay network traffic on ISP peering

1389-1286/$ see front matter 2008 Elsevier B.V doi:10.1016/j.comnet.2008.06.014 * Corresponding author. Tel.: +852 2609 8357; fa E-mail addresses: [email protected] (J.H. Wa edu.hk (D.M. Chiu), [email protected] (J.C.S. Lui Inter-ISP traffic flow determines the settlement between ISPs and affects the perceived performance of ISP services. In today’s Internet, the inter-ISP traffic flow pa...

متن کامل

Distributed Biobjective Ant Colony Algorithm for Low Cost Overlay Network Routing

In this paper we introduce a biobjective ant colony algorithm for constructing low cost overlay routing networks. The ant colony algorithm is distributed and adaptive in finding shortest paths from source to destination nodes while also constructing a low cost overlay routing network. Additionally, we define a cost model for overlay network construction that includes network traffic demands. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006